Paul Turán’s influence in combinatorics
نویسندگان
چکیده
This paper is a survey on the topic in extremal graph theory influenced directly or indirectly by Paul Turán. While trying to cover a fairly wide area, I will try to avoid most of the technical details. Areas covered by detailed fairly recent surveys will also be treated only briefly. The last part of the survey deals with random ±1 matrices, connected to some early results of Szekeres and Turán.
منابع مشابه
Extremal Results in Random Graphs
According to Paul Erdős [Some notes on Turán’s mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Turán who “created the area of extremal problems in graph theory”. However, without a doubt, Paul Erdős popularized extremal combinatorics, by his many contributions to the field, his numerous questions and conjectures, and his influence on discrete mathematicians in Hungary and al...
متن کاملLongest Paths in Circular Arc Graphs
We show that all maximum length paths in a connected circular arc graph have non–empty intersection.
متن کاملOn the number of connecting lines determined by n points in the real plane
We consider the problem of determining for which integers k and n can a minimum k-perfect covering on n points be embedded in the real projective plane.
متن کامل3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected
We investigate pairs of forbidden subgraphs that imply a 3-connected graph is Hamiltonian-connected. In particular we show that the pair {K1,3, P9} is such a pair. As it is known that P10 cannot replace P9, this result is best possible. Further, we show that certain other graphs are not possible.
متن کاملParallel algorithms for generalized clique transversal problems
The K `-clique transversal problem is to locate a minimum collection of cliques of size ` in a graph G such that every maximal clique of sizè in G contains at least one member of the collection. We give an NC algorithm to solve this problem on strongly chordal graphs.
متن کامل